TSTP Solution File: SEV417^5 by Lash---1.13
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Lash---1.13
% Problem : SEV417^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : lash -P picomus -M modes -p tstp -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 19:34:31 EDT 2023
% Result : Theorem 0.19s 0.42s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 45
% Syntax : Number of formulae : 57 ( 16 unt; 6 typ; 1 def)
% Number of atoms : 136 ( 11 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 270 ( 108 ~; 16 |; 0 &; 69 @)
% ( 15 <=>; 62 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 18 con; 0-2 aty)
% Number of variables : 51 ( 24 ^; 27 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_a,type,
a: $tType ).
thf(ty_cP,type,
cP: ( a > $o ) > $o ).
thf(ty_eigen__2,type,
eigen__2: a > $o ).
thf(ty_eigen__3,type,
eigen__3: a ).
thf(ty_eigen__0,type,
eigen__0: a > $o ).
thf(ty_eigen__1,type,
eigen__1: a > $o ).
thf(h0,assumption,
! [X1: a > $o,X2: a] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__3,definition,
( eigen__3
= ( eps__0
@ ^ [X1: a] :
~ ~ ( eigen__0 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[eigen__3])]) ).
thf(sP1,plain,
( sP1
<=> ( cP
@ ^ [X1: a] :
~ ( ( eigen__1 @ X1 )
=> ~ ( eigen__2 @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( ( eigen__0 @ eigen__3 )
=> ( eigen__2 @ eigen__3 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( cP
@ ^ [X1: a] : $false ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( eigen__0 @ eigen__3 ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: a] :
( ( eigen__0 @ X1 )
=> ( eigen__1 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( sP4
=> ( eigen__1 @ eigen__3 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( ( eigen__1 @ eigen__3 )
=> ~ ( eigen__2 @ eigen__3 ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ( eigen__0
= ( ^ [X1: a] : $false ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ! [X1: a] :
( ( eigen__1 @ X1 )
=> ~ ( eigen__2 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( ( ^ [X1: a] :
~ ( ( eigen__1 @ X1 )
=> ~ ( eigen__2 @ X1 ) ) )
= ( ^ [X1: a] : $false ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( sP8
=> ~ sP3 ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ! [X1: a] :
~ ( eigen__0 @ X1 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( eigen__2 @ eigen__3 ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ( eigen__1 @ eigen__3 ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ! [X1: a] :
( ( eigen__0 @ X1 )
=> ( eigen__2 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(cTHM502_pme,conjecture,
! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ~ ( ~ ( ~ ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ X4 ) )
=> ~ ! [X4: a] :
( ( X1 @ X4 )
=> ( X3 @ X4 ) ) )
=> ( ( ^ [X4: a] :
~ ( ( X2 @ X4 )
=> ~ ( X3 @ X4 ) ) )
!= ( ^ [X4: a] : $false ) ) )
=> ~ ( cP
@ ^ [X4: a] :
~ ( ( X2 @ X4 )
=> ~ ( X3 @ X4 ) ) ) )
=> ~ ( ( X1
= ( ^ [X4: a] : $false ) )
=> ~ sP3 ) ) ).
thf(h1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ~ ( ~ ( ~ ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ X4 ) )
=> ~ ! [X4: a] :
( ( X1 @ X4 )
=> ( X3 @ X4 ) ) )
=> ( ( ^ [X4: a] :
~ ( ( X2 @ X4 )
=> ~ ( X3 @ X4 ) ) )
!= ( ^ [X4: a] : $false ) ) )
=> ~ ( cP
@ ^ [X4: a] :
~ ( ( X2 @ X4 )
=> ~ ( X3 @ X4 ) ) ) )
=> ~ ( ( X1
= ( ^ [X4: a] : $false ) )
=> ~ sP3 ) ),
inference(assume_negation,[status(cth)],[cTHM502_pme]) ).
thf(h2,assumption,
~ ! [X1: a > $o,X2: a > $o] :
( ~ ( ~ ( ~ ( ! [X3: a] :
( ( eigen__0 @ X3 )
=> ( X1 @ X3 ) )
=> ~ ! [X3: a] :
( ( eigen__0 @ X3 )
=> ( X2 @ X3 ) ) )
=> ( ( ^ [X3: a] :
~ ( ( X1 @ X3 )
=> ~ ( X2 @ X3 ) ) )
!= ( ^ [X3: a] : $false ) ) )
=> ~ ( cP
@ ^ [X3: a] :
~ ( ( X1 @ X3 )
=> ~ ( X2 @ X3 ) ) ) )
=> ~ sP11 ),
introduced(assumption,[]) ).
thf(h3,assumption,
~ ! [X1: a > $o] :
( ~ ( ~ ( ~ ( sP5
=> ~ ! [X2: a] :
( ( eigen__0 @ X2 )
=> ( X1 @ X2 ) ) )
=> ( ( ^ [X2: a] :
~ ( ( eigen__1 @ X2 )
=> ~ ( X1 @ X2 ) ) )
!= ( ^ [X2: a] : $false ) ) )
=> ~ ( cP
@ ^ [X2: a] :
~ ( ( eigen__1 @ X2 )
=> ~ ( X1 @ X2 ) ) ) )
=> ~ sP11 ),
introduced(assumption,[]) ).
thf(h4,assumption,
~ ( ~ ( ~ ( ~ ( sP5
=> ~ sP15 )
=> ~ sP10 )
=> ~ sP1 )
=> ~ sP11 ),
introduced(assumption,[]) ).
thf(h5,assumption,
~ ( ~ ( ~ ( sP5
=> ~ sP15 )
=> ~ sP10 )
=> ~ sP1 ),
introduced(assumption,[]) ).
thf(h6,assumption,
sP11,
introduced(assumption,[]) ).
thf(h7,assumption,
~ ( ~ ( sP5
=> ~ sP15 )
=> ~ sP10 ),
introduced(assumption,[]) ).
thf(h8,assumption,
sP1,
introduced(assumption,[]) ).
thf(h9,assumption,
~ ( sP5
=> ~ sP15 ),
introduced(assumption,[]) ).
thf(h10,assumption,
sP10,
introduced(assumption,[]) ).
thf(h11,assumption,
sP5,
introduced(assumption,[]) ).
thf(h12,assumption,
sP15,
introduced(assumption,[]) ).
thf(1,plain,
( ~ sP2
| ~ sP4
| sP13 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP6
| ~ sP4
| sP14 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP7
| ~ sP14
| ~ sP13 ),
inference(prop_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP15
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP5
| sP6 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP9
| sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP1
| sP3
| ~ sP10 ),
inference(mating_rule,[status(thm)],]) ).
thf(8,plain,
( sP12
| sP4 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__3]) ).
thf(9,plain,
( ~ sP10
| sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(10,plain,
( sP8
| ~ sP12 ),
inference(prop_rule,[status(thm)],]) ).
thf(11,plain,
( ~ sP11
| ~ sP8
| ~ sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(12,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h11,h12,h9,h10,h7,h8,h5,h6,h4,h3,h2,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,h11,h12,h10,h8,h6]) ).
thf(13,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h9,h10,h7,h8,h5,h6,h4,h3,h2,h1,h0]),tab_negimp(discharge,[h11,h12])],[h9,12,h11,h12]) ).
thf(14,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h7,h8,h5,h6,h4,h3,h2,h1,h0]),tab_negimp(discharge,[h9,h10])],[h7,13,h9,h10]) ).
thf(15,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h5,h6,h4,h3,h2,h1,h0]),tab_negimp(discharge,[h7,h8])],[h5,14,h7,h8]) ).
thf(16,plain,
$false,
inference(tab_negimp,[status(thm),assumptions([h4,h3,h2,h1,h0]),tab_negimp(discharge,[h5,h6])],[h4,15,h5,h6]) ).
thf(17,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h3,h2,h1,h0]),tab_negall(discharge,[h4]),tab_negall(eigenvar,eigen__2)],[h3,16,h4]) ).
thf(18,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h2,h1,h0]),tab_negall(discharge,[h3]),tab_negall(eigenvar,eigen__1)],[h2,17,h3]) ).
thf(19,plain,
$false,
inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__0)],[h1,18,h2]) ).
thf(20,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[19,h0]) ).
thf(0,theorem,
! [X1: a > $o,X2: a > $o,X3: a > $o] :
( ~ ( ~ ( ~ ( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ X4 ) )
=> ~ ! [X4: a] :
( ( X1 @ X4 )
=> ( X3 @ X4 ) ) )
=> ( ( ^ [X4: a] :
~ ( ( X2 @ X4 )
=> ~ ( X3 @ X4 ) ) )
!= ( ^ [X4: a] : $false ) ) )
=> ~ ( cP
@ ^ [X4: a] :
~ ( ( X2 @ X4 )
=> ~ ( X3 @ X4 ) ) ) )
=> ~ ( ( X1
= ( ^ [X4: a] : $false ) )
=> ~ sP3 ) ),
inference(contra,[status(thm),contra(discharge,[h1])],[19,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV417^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : lash -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 04:16:47 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 % Mode: cade22grackle2xfee4
% 0.19/0.42 % Steps: 63
% 0.19/0.42 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------